| 翻訳と辞書 |
| ancestral graph ： ウィキペディア英語版 |
ancestral graph
In statistics and Markov modeling, an ancestral graph is a type of mixed graph to provide a graphical representation for the result of marginalizing one or more vertices in a graphical model that takes the form of a directed acyclic graph.
==Definition==
Ancestral graphs are mixed graphs used with three kinds of edges: directed edges, drawn as an arrow from one vertex to another, bidirected edges, which have an arrowhead at both ends, and undirected edges, which have no arrowheads. It is required to satisfy some additional constraints:
*If there is an edge from a vertex ''u'' to another vertex ''v'', with an arrowhead at ''v'' (that is, either an edge directed from ''u'' to ''v'' or a bidirected edge), then there does not exist a path from ''v'' to ''u'' consisting of undirected edges and/or directed edges oriented consistently with the path.
*If a vertex ''v'' is an endpoint of an undirected edge, then it is not also the endpoint of an edge with an arrowhead at ''v''.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「ancestral graph」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|